Lambda Calculus with Explicit Recursion
نویسندگان
چکیده
منابع مشابه
Lambda Calculus with Explicit Recursion
This paper is concerned with the study of-calculus with explicit recursion, namely of cyclic-graphs. The starting point is to treat a-graph as a system of recursion equations involving-terms, and to manipulate such systems in an unrestricted manner, using equational logic, just as is possible for rst-order term rewriting. Surprisingly, now the connuence property breaks down in an essential way....
متن کاملA Metric Model of Lambda Calculus with Guarded Recursion
We give a model for Nakano’s typed lambda calculus with guarded recursive definitions in a category of metric spaces. By proving a computational adequacy result that relates the interpretation with the operational semantics, we show that the model can be used to reason about contextual equivalence.
متن کاملExplicit Substitutions for the Lambda � Mu Calculus �
We present a con uent rewrite system which extents a previous calculus of explicit substitu tions for the lambda calculus HaLe to Parigot s untyped lambda mu calculus Par This extension embeds the lambda mu calculus as a sub theory and provides the basis for a theoretical framework to study the abstract properties of implementations of functional pro gramming languages enriched with control str...
متن کاملLambda Calculus with Types
This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author’s classic The Lambda Calculus (1984). The formalism has since been extended with types...
متن کاملLambda calculus with patterns
The -calculus is an extension of the -calculus with a pattern matching facility. The form of the argument of a function can be speci ed and hence -calculus is more convenient than ordinary -calculus. We explore the basic theory of -calculus, establishing results such as con uence. In doing so, we nd some requirements for patterns that guarantee con uence. Our work can be seen as giving some fou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1997
ISSN: 0890-5401
DOI: 10.1006/inco.1997.2651